A note on bump functions that locally depend on finitely many coordinates
نویسندگان
چکیده
منابع مشابه
a note on groups with many locally supersoluble subgroups
it is proved here that if $g$ is a locally graded group satisfying the minimal condition on subgroups which are not locally supersoluble, then $g$ is either locally supersoluble or a vcernikov group. the same conclusion holds for locally finite groups satisfying the weak minimal condition on non-(locally supersoluble) subgroups. as a consequence, it is shown that any infinite locally graded gro...
متن کاملBoolean Functions With Low Average Sensitivity Depend On Few Coordinates
Consider a function f : f0;1g n ! f0;1g. The sensitivity of a point v 2 f0;1g n is jfv 0 : f (v 0) 6 = f (v); dist(v; v 0) = 1gj, i.e. the number of neighbors of the point in the discrete cube on which the value of f diiers. The average sensitivity of f is the average of the sensitivity of all points in f0;1g n. (This can also be interpreted as the sum of the innuences of the n variables on f ,...
متن کاملOn solubility of groups with finitely many centralizers
For any group G, let C(G) denote the set of centralizers of G.We say that a group G has n centralizers (G is a Cn-group) if |C(G)| = n.In this note, we prove that every finite Cn-group with n ≤ 21 is soluble andthis estimate is sharp. Moreover, we prove that every finite Cn-group with|G| < 30n+1519 is non-nilpotent soluble. This result gives a partial answer to aconjecture raised by A. Ashrafi in ...
متن کاملHarmonic Coordinates on Finitely Connected Fractafolds
We define finitely connected fractafolds, which are generalizations of p.c.f. self-similar sets introduced by Kigami and of fractafolds introduced by Strichartz. Any self-similarity is not assumed, and countably infinite ramification is allowed. We prove that if a fractafold has a resistance form in the sense of Kigami that satisfies certain assumptions, then there exists a weak Riemannian metr...
متن کاملA Note on Finitely Derived Information Systems
The notion of information system initially introduced by Scott provides an efficient approach to represent various kinds of domains. In this note, a new type of information systems named finitely derived information systems is introduced. For this notion, the requirement for the consistency predicate used in Scott’s information systems is simplified, and the reflexive and transitive rules for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1997
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700031233